Network growth with preferential attachment for high indegree and low outdegree
نویسندگان
چکیده
منابع مشابه
Network Growth with Preferential Attachment for High Indegree and Low Outdegree
We study the growth of a directed transportation network, such as a food web, in which links carry resources. We propose a growth process in which new nodes (or species) preferentially attach to existing nodes with high indegree (in food-web language, number of prey) and low outdegree (or number of predators). This scheme, which we call inverse preferential attachment , is intended to maximize ...
متن کاملA random intersection digraph: Indegree and outdegree distributions
Let S(1), . . . , S(n), T (1), . . . , T (n) be random subsets of the set [m] = {1, . . . ,m}. We consider the random digraph D on the vertex set [n] defined as follows: the arc i → j is present in D whenever S(i)∩T (j) 6= ∅. Assuming that the pairs of sets (S(i), T (i)), 1 ≤ i ≤ n, are independent and identically distributed, we study the inand outdegree distributions of a typical vertex of D ...
متن کاملNetwork Growth via Preferential Attachment based on Prisoner’s Dilemma Game
In this article we discuss network growth based on Prisoner’s Dilemma Game(PDG) where palyers on nodes in a network palay with its linked players. The players estimate total profits according to the payoff matrix of the PDG. When a new node is attached to the network, the node make linkes to nodes in the network with the probabilities in proportion to the profits made by the game. Iterating thi...
متن کاملSublinear but Never Superlinear Preferential Attachment by Local Network Growth
We investigate a class of network growth rules that are based on a redirection algorithm wherein new nodes are added to a network by linking to a randomly chosen target node with some probability 1− r or linking to the parent node of the target node with probability r. For fixed 0 < r < 1, the redirection algorithm is equivalent to linear preferential attachment. We show that when r is a decayi...
متن کاملNetwork growth with arbitrary initial conditions: degree dynamics for uniform and preferential attachment.
This paper provides time-dependent expressions for the expected degree distribution of a given network that is subject to growth. We consider both uniform attachment, where incoming nodes form links to existing nodes selected uniformly at random, and preferential attachment, where probabilities are assigned proportional to the degrees of the existing nodes. We consider the cases of single and m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2008
ISSN: 0378-4371
DOI: 10.1016/j.physa.2008.01.034